On Formal Analysis of OO Languages Using Rewriting Logic: Designing for Performance
نویسندگان
چکیده
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different designs for the same language feature can cause drastic differences in analysis performance. This paper describes some of these design decisions in the context of KOOL, a concurrent, dynamic, object-oriented language. Also described is a general mechanism used in KOOL to support model checking while still allowing for ongoing, sometimes major, changes to the language definition.
منابع مشابه
From Rewriting Logic, to Programming Language Semantics, to Program Verification
Rewriting logic has proven to be an excellent formalism to define executable semantics of programming languages, concurrent or not, and then to derive formal analysis tools for the defined languages with very little effort, such as model checkers. In this paper we give an overview of recent results obtained in the context of the rewriting logic semantics framework K, such as complete semantics ...
متن کاملRewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of powerful software analysis tools. Such tools can be obtained for free from the semantic definitions; in our experience in just the few weeks required to define a language’s semantics even for large languages like Java. B...
متن کاملUsing Rewriting Logic to implement FULL
A common problem of automated tools for Formal Methods is their difficulty in dealing with infinite systems. Such systems may arise through the use of infinite data types. For example, in the LOTOS [6] formal description technique the simple process g?x : Nat; exit results in an infinite choice, one for each member of Nat. Rewriting logic [7] is a possible approach to dealing with such systems....
متن کاملDesigning an adaptive fuzzy control for robot manipulators using PSO
This paper presents designing an optimal adaptive controller for tracking control of robot manipulators based on particle swarm optimization (PSO) algorithm. PSO algorithm has been employed to optimize parameters of the controller and hence to minimize the integral square of errors (ISE) as a performance criteria. In this paper, an improved PSO using logic is proposed to increase the convergenc...
متن کاملAutomated Termination Analysis: From Term Rewriting to Programming Languages
Termination is a crucial property of programs. Therefore, techniques to analyze termination automatically are highly important for program verification. Traditionally, techniques for automated termination analysis were mainly studied for declarative programming paradigms such as logic programming and term rewriting. However, in the last years, several powerful techniques and tools have been dev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007